Conjugate Duality and Optimization

نویسندگان

  • D. V. LINDLEY
  • S. A. ORSZAG
چکیده

Kuhn-Tucker condition (0, 0) e dK(x, y) into a more explicit and familiar form. Writing where -k(y) = /0(x) + ylfl(x] + • • • + ymfm(x) and P is the nonnegative orthant in R, we see from the example following Theorem 20 that the condition 0 e dyK(x, y) holds if and only if the vector On the other hand, for y e P we have by Theorem 20, assuming for example that f{ is a continuous function for i = 1, • • • , m (as follows from Corollary 8 A if X = jR"). Moreover, for ft ^ 0 and ff finite one has trivially the relation The abstract Kuhn-Tucker condition is therefore equivalent to conditions (10.2) and (10.5), assuming /) is continuous for i = 1, • • • , m. If/ is differentiate, (10.5) reduces of course to Example 6. (Stochastic programming.) The given problem is and the chosen representation involves where h is measurable on X x S (relative to the Borel structure on X) and convex in the X argument, and C is a nonempty closed subset of X. In order to apply the theory of integral functionals in § 9 at its fullest, we shall assume X is a separable, reflexive Banach space (whose dual is identifiable with V under the pairing <x, y», and where the measure space is complete and has, of course, a(S) = 1. (In the pairing Formula (10.3) thus allows us to write the condition 0 e BxK(x, y) as is normal to P at y. This means that 66 R. TYRRELL ROCKAFELLAR between U and 7, we take the norm topology on Y, but the Mackey topology on U; see the end of § 7.) We shall assume further that h(x, s) is finite and lowersemicontinuous in .v for all s, and h(u(s),s) is summable in 5 for every ueU. (If X = /?", the latter assumption can be weakened to the summability of /j(x, s) in 5 for each x e X.) These assumptions imply via Theorem 22 that F is a closed convex function on X x t/, and indeed F(x, u) is finite and continuous in u in the Mackey topology for each x. The Lagrangian function can be calculated as

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conjugate duality for multiobjective composed optimization problems

Given a multiobjective optimization problem with the components of the objective function as well as the constraint functions being composed convex functions, we introduce, by using the Fenchel-Moreau conjugate of the functions involved, a suitable dual problem to it. Under a standard constraint qualification and some convexity as well as monotonicity conditions we prove the existence of strong...

متن کامل

New Constraint Qualification and Conjugate Duality for Composed Convex Optimization Problems

We present a new constraint qualification which guarantees strong duality between a cone-constrained convex optimization problem and its Fenchel-Lagrange dual. This result is applied to a convex optimization problem having, for a given nonempty convex cone K , as objective function a K-convex function postcomposed with a K-increasing convex function. For this so-called composed convex optimizat...

متن کامل

Farkas-type results for inequality systems with composed convex functions via conjugate duality

We present some Farkas-type results for inequality systems involving finitely many functions. Therefore we use a conjugate duality approach applied to an optimization problem with a composed convex objective function and convex inequality constraints. Some recently obtained results are rediscovered as special cases of our main result.

متن کامل

Duality for Linear Chance-constrained Optimization Problems

In this paper we deal with linear chance-constrained optimization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertainty. After giving the deterministic equivalent formulation of a linear chance-constrained optimization problem we construct a conjugate dual problem ...

متن کامل

Robust Conjugate Duality for Convex Optimization under Uncertainty with Application to Data Classification∗

In this paper we present a robust conjugate duality theory for convex programming problems in the face of data uncertainty within the framework of robust optimization, extending the powerful conjugate duality technique. We first establish robust strong duality between an uncertain primal parameterized convex programming model problem and its uncertain conjugate dual by proving strong duality be...

متن کامل

Lagrangian duality and perturbational duality I ∗

Our approach to the Karush-Kuhn-Tucker theorem in [OSC] was entirely based on subdifferential calculus (essentially, it was an outgrowth of the two subdifferential calculus rules contained in the Fenchel-Moreau and Dubovitskii-Milyutin theorems, i.e., Theorems 2.9 and 2.17 of [OSC]). On the other hand, Proposition B.4(v) in [OSC] gives an intimate connection between the subdifferential of a fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1974